satisfiability problem
英
美
网络 可满足性问题; 性问题; SAT问题; 满足性问题; 布尔可满足性问题
双语例句
- The satisfiability problem of conjunction normal form ( abbreviate SAT problem) is an NP_complete problem.
合取范式可满足性问题（简称SAT问题）是一个NP完全问题。 - Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。 - When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.
当解释的论域是一个固定大小的有限集合时，一阶逻辑公式的可满足性问题可以等价地归约为SAT问题。 - A Transition Matrix Model of Local Search Algorithm for Satisfiability Problem
SAT局部搜索算法的转移矩阵模型 - Thus, the subset of satisfiability problem that originally belongs to the Class NP-Completeness is demonstrated to be belonging to the Class P.
从而，把原来属于NP-完全类的SAT问题的一个子集，划入了P类。 - Two heuristic strategies for solving satisfiability ( SAT) problem were presented.
提出了两个用于求解可满足性（SAT）问题的启发式策略。 - To overcome this problem, an approach of identifying false paths based on Satisfiability ( SAT) and generic search algorithm for the satisfiability problem ( GRASP) algorithms was adopted and a new detection algorithm for critical paths in combinatorial circuits based on the identification approach was presented.
为了克服该问题，文中给出一种基于SAT和GRASP求解算法的识别伪路径的方法，在此基础上引入动态期望值的手段得到一种检测组合电路中的关键路径的快速方法。 - How to solve the Boolean Satisfiability Problem ( SAT) by genetic algorithms is discussed. The applications of the results for other NP Complete problems are also shown.
讨论了如何利用遗传算法求解布尔表达式的可满足性问题，并给出该结果对求解其他NP完全问题时的应用。 - The Analysis of Algorithms for the Propositional Logic Satisfiability Problem
命题逻辑可满足性问题的算法分析 - In the second part we give a game-theoretic characterization for modal mu-calculus's satisfiability problem.
第二部分对模态μ演算上的可满足性问题进行了博弈刻画，对可满足性公式可以进行模型构建，对不可满足公式可以生成反例。 - Our approach is based on an extended relational calculus, and reduces the consistency problem to a satisfiability problem of relational formulae.
该方法以扩展的关系逻辑为语义基础，把一致性问题归结为关系逻辑公式的可满足性问题。 - Solving satisfiability problem by wu's method(ⅰ) algorithm transform
用吴方法求解可满足性问题（Ⅰ）&算法变换 - Based on the concept of organization, a novel algorithm, organizational evolutionary algorithm for SAT problem, is proposed to deal with the satisfiability problem.
针对SAT问题，提出了求解SAT问题的组织进化算法。 - A Probabilistic Study on the Satisfiability Problem
可满足性（SAT）问题的概率研究 - SAT problem in classical logic means the satisfiability problem of boolean formulas. it is an essential problem of computer science.
经典逻辑中的SAT问题是指布尔表达式的可满足性问题，它是计算机科学中的核心问题。 - We study satisfiability problem to decide that whether there exists a truth assignment which can satisfy a given logical expression.
可满足性问题（SAT）研究如何判定一个任意给定的逻辑表达式是否存在可满足真值指派。 - Propositional Satisfiability Problem ( SAT) is a well known problem in computer science and artificial intelligence research.
SAT问题是计算机科学和人工智能研究的领域的著名问题。 - By following this trend, this thesis can be divided into two parts: I. The research of Satisfiability problem ( SAT).
本文的研究工作针对这个趋势，可以分成两个部分：Ⅰ.可满足性算法的研究。 - Experiments are conducted and the experimental results show that the NS has good ability of helping the ENSA escape from local optima for solving the Satisfiability problem.
大量的实验结果表明，非选择在求解可满足性问题时具有协助算法跳出局部最优的作用。 - Complete algorithm is different from the incomplete algorithm. It not only can guarantee find a model for a satisfiability problem, but also it can be used to prove that a problem is unsatisfiable.
完备算法与不完备性算法不同，它不仅可以保证为可满足SAT问题的给出它的一个模型，同时可以证明不可满足SAT问题的不可满足性，故而大多数SAT算法都是完备性算法。 - Propositional satisfiability problem ( SAT) is the core issue in the field of artificial intelligence, but also the basis for solving many practical problems.
命题可满足问题（satisfiabilityproblem，SAT）是人工智能领域中的核心问题，也是解决许多实际问题的基础。 - Based on these problems, we present a novel method to translate the software dependency satisfiability identification problem into a CNF-SAT problem, and identify the dependency conflicts by solve the SAT problem.
基于上述不足，本文提出了将软件依赖可满足性识别问题转化为CNF-SAT问题的方法，通过求解CNF-SAT问题，识别软件依赖关系中的冲突。 - Satisfiability ( SAT) problem has been the core problem of research on computational theory.
可满足性问题（SAT）是当代理论计算机科学的核心问题。 - The Satisfiability problem ( SAT) is one of the six basic NP-complete problems. Other NP-complete problems could be transformed into the Satisfiability problem in polynomial time.
可满足性问题是六个基本的NP完全问题之一，其他NP完全问题均可在多项式时间内转换为可满足性问题。